1 Synthesis of Decisionsystemsfrom Data

We discuss two basic questions related to the synthesis of decision algorithms. The rst question can be formulated as follows: what strategies can be used in order to discover the decision rules from experimental data? Answering this question, we propose to build these strategies on the basis of rough set methods and Boolean reasoning techniques. We present some applications of these methods for extracting decision rules from decision tables used to represent experimental data. The second question can be formulated as follows: what is a general framework for approximate reasoning in distributed systems? Answering this question, we assume that distributed systems are organized on rough mereological principles in order to assembly (construct) complex objects satisfying a given speciication in a satisfactory degree. We discuss how this approach can be used for building the foundations for approximate reasoning. Our approach is based on rough mereology, the recently developed extension of mereology of Le sniewski.